Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
نویسندگان
چکیده
منابع مشابه
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
We consider relaxations for nonconvex quadratically constrained quadratic programming (QCQP) based on semidefinite programming (SDP) and the reformulation-linearization technique (RLT). From a theoretical standpoint we show that the addition of a semidefiniteness condition removes a substantial portion of the feasible region corresponding to product terms in the RLT relaxation. On test problems...
متن کاملOn Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some important results on QCQP, like the S-Procedure, and the strength of Lagrangian Relaxation and the semi...
متن کاملHidden convexity in some nonconvex quadratically constrained quadratic programming
We consider the problem of minimizing an indefinite quadratic objective function subject to twosided indelinite quadratic constraints. Under a suitable simultaneous diagonalization assumption {which trivially holds for trust region type problems), we prove that the original problem is equivalent to a convex minimization problem with simple linear constraints. We then consider a special problem ...
متن کاملSemidefinite-Based Branch-and-Bound for Nonconvex Quadratic Programming
This paper presents a branch-and-bound algorithm for nonconvex quadratic programming, which is based on solving semidefinite relaxations at each node of the enumeration tree. The method is motivated by a recent branch-and-cut approach for the box-constrained case that employs linear relaxations of the first-order KKT conditions. We discuss certain limitations of linear relaxations when handling...
متن کاملOn convex relaxations for quadratically constrained quadratic programming
We consider convex relaxations for the problem of minimizing a (possibly nonconvex) quadratic objective subject to linear and (possibly nonconvex) quadratic constraints. Let F denote the feasible region for the linear constraints. We first show that replacing the quadratic objective and constraint functions with their convex lower envelopes on F is dominated by an alternative methodology based ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2008
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-008-9372-0